A Typed Language for Truthful One-Dimensional Mechanism Design

We first introduce a very simple typed language for expressing allocation algorithms that allows automatic verification that an algorithm is monotonic and therefore truthful. The analysis of truthfulness is accomplished using a syntax-directed transformation which constructs a proof of monotonicity based on an exhaustive critical-value analysis of the algorithm. We then define a more high-level, general-purpose programming language with typical constructs, such as those for defining recursive functions, along with primitives that match allocation algorithm combinators found in the work of Mu'alem and Nisan [10]. We demonstrate how this language can be used to combine both primitive and user-defined combinators, allowing it to capture a collection of basic truthful allocation algorithms. In addition to demonstrating the value of programming language design techniques in application to a specific domain, this work suggests a blueprint for interactive tools that can be used to teach the simple principles of truthful mechanism desig

Adolescent Literacy Programs: Costs of Implementation

Reviews the literature on implementation of educational reforms and compares implementation processes and costs at schools that have adopted one of three literacy reforms. Includes recommendations for detailed resource planning and cost accounting

Return-Oriented Programming Detection and Prevention Utilizing a Hardware and Software Adaptation

This publication describes techniques aimed at detecting and preventing return-oriented programming (ROP) attacks. The techniques consist of a software adaptation which enables supplemental hardware, specifically a system on a chip (SoC), to chronologically log return (ret) addresses of pushed stack frames and compare those logged ret addresses to ret commands executed by a central processing unit (CPU) of a computing system. When the SoC determines that ret commands executed by the CPU have deviated from the logged ret addresses, then the SoC can take action to thwart a ROP attack

Reggeon Field Theory for Large Pomeron Loops

We analyze the range of applicability of the high energy Reggeon Field Theory $H_{RFT}$ derived in [1]. We show that this theory is valid as long as at any intermediate value of rapidity $\eta$ throughout the evolution at least one of the colliding objects is dilute. Importantly, at some values of $\eta$ the dilute object could be the projectile, while at others it could be the target, so that $H_{RFT}$ does not reduce to either $H_{JIMWLK}$ or $H_{KLWMIJ}$. When both objects are dense, corrections to the evolution not accounted for in [1] become important. The same limitation applies to other approaches to high energy evolution available today, such as for example [3] and [4]. We also show that, in its regime of applicability $H_{RFT}$ can be simplified. We derive the simpler version of $H_{RFT}$ and in the large $N_c$ limit rewrite it in terms of the Reggeon creation and annihilation operators. The resulting $H_{RFT}$ is explicitly self dual and provides the generalization of the Pomeron calculus developed in [4] by including higher Reggeons in the evolution. It is applicable for description of `large' Pomeron loops, namely Reggeon graphs where all the splittings occur close in rapidity to one dilute object (projectile), while all the merging close to the other one (target). Additionally we derive, in the same regime expressions for single and double inclusive gluon production (where the gluons are not separated by a large rapidity interval) in terms of the Reggeon degrees of freedom.Comment: 38 pages, 4 figure

Pediatric ophthalmology and strabismus: something for everyone.

This issue of Current Opinion in Ophthalmology highlights the uniquely broad range of pediatric ophthalmology and strabismus. Perhaps, unlike any other area of ophthalmology, our specialty covers virtually every part of the eye and a multitude of systemic disorders. Pediatric ophthalmology offers the practitioner the opportunity to impact a patient’s visual life for many decades giving them a lifetime of good vision. This issue of the journal highlights the many ways that this is so

Measurable Dynamics of Maps on Profinite Groups

We study the measurable dynamics of transformations on profinite groups, in particular of those which factor through sufficiently many of the projection maps; these maps generalize the 1-Lipschitz maps on $\mathbb Z_p$.Comment: 18 page

KLWMIJ Reggeon Field Theory beyond the large NcN_c limit

We extend the analysis of KLWMIJ evolution in terms of QCD Reggeon fields beyond leading order in the $1/N_c$ expansion. We show that there is only one type of corrections to the leading order Hamiltonian discussed in \cite{last}. These are terms linear in original Reggeons and quadratic in conjugate Reggeon operators. All of these have the interpretation as vertices of the "`merging"' type $2\rightarrow 1$, where two Reggeons merge into one. Importantly, the triple Pomeron merging vertex does not emerge from the KLWMIJ Hamiltonian. We show that, although in the range of applicability of the KLWMIJ Hamiltonian these merging terms are subleading in $N_c$, in the dense-dense regime they all become of the same (leading) order in $N_c$. In this regime vertices involving higher Reggeons are enhanced by inverse powers of the coupling constant.Comment: 25 page